Quasirandom Spanning Tree Model for the Early River Network
نویسندگان
چکیده
منابع مشابه
A Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملVirtual Private Network to Spanning Tree Mapping
Metro Ethernet has been widely adopted lately. One of its goals is to provide clients with VPN services, and in this context, loadbalancing and protection have become important issues. This paper presents an original formulation of these problems in Metro Ethernet, and introduces an algorithm for load balancing which provides good numerical results.
متن کاملSpanning Tree Problem of Uncertain Network
In this paper we consider a spanning tree problem of uncertain network, which is a natural uncertain variation of the deterministic minimum spanning tree problem. By means of uncertainty theory, we propose three types of minimum spanning tree models for uncertain network, i.e., expected minimum spanning tree, α-minimum spanning tree, and distribution minimum spanning tree. Generally, we can the...
متن کاملLegendrian links and the spanning tree model for Khovanov homology
The Khovanov homology has led to many interesting new developments in knot theory and related fields. See Lee [4, 5], Ng [6], Plamenevskaya [7] and Rasmussen [8] for examples. It is still very difficult to compute the Khovanov homology in general. Recently, A Champanerkar and I Kofman [2] and, independently, S Wehrli [11] constructed a spanning tree model for the Khovanov homology based on the ...
متن کاملLeast Cost Multicast Spanning Tree Algorithm for Local Computer Network
This study deals with the topology discovery for the capacitated minimum spanning tree network. The problem is composed of finding the best way to link nodes to a source node and, in graph-theoretical terms, it is to determine a minimal spanning tree with a capacity constraint. In this paper, a heuristic algorithm with two phases is presented. Computational complexity analysis and simulation co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 1996
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.76.3460